Singular value inequality and graph energy change
نویسنده
چکیده
The energy of a graph is the sum of the singular values of its adjacency matrix. A classic inequality for singular values of a matrix sum, including its equality case, is used to study how the energy of a graph changes when edges are removed. One sharp bound and one bound that is never sharp, for the change in graph energy when the edges of a nonsingular induced subgraph are removed, are established. A graph is nonsingular if its adjacency matrix is nonsingular.
منابع مشابه
Graph Energy Change Due to Edge Deletion
The energy of a graph is the sum of the singular values of its adjacency matrix. We are interested in how the energy of a graph changes when edges are deleted. Examples show that all cases are possible: increased, decreased, unchanged. Our goal is to find possible graph theoretical descriptions and to provide an infinite family of graphs for each case. The main tool is a singular value inequali...
متن کاملA Generalized Singular Value Inequality for Heinz Means
In this paper we will generalize a singular value inequality that was proved before. In particular we obtain an inequality for numerical radius as follows: begin{equation*} 2 sqrt{t (1-t)} omega(t A^{nu}B^{1-nu}+(1-t)A^{1-nu}B^{nu}) leq omega(t A + (1- t) B), end{equation*} where, $ A $ and $ B $ are positive semidefinite matrices, $ 0 leq t leq 1 $ and $ 0 leq nu leq frac{3}{2}.$
متن کاملGraph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کاملChange Point Estimation of the Stationary State in Auto Regressive Moving Average Models, Using Maximum Likelihood Estimation and Singular Value Decomposition-based Filtering
In this paper, for the first time, the subject of change point estimation has been utilized in the stationary state of auto regressive moving average (ARMA) (1, 1). In the monitoring phase, in case the features of the question pursue a time series, i.e., ARMA(1,1), on the basis of the maximum likelihood technique, an approach will be developed for the estimation of the stationary state’s change...
متن کاملA note on the bounds of Laplacian-energy-like-invariant
The Laplacian-energy-like of a simple connected graph G is defined as LEL:=LEL(G)=∑_(i=1)^n√(μ_i ), Where μ_1 (G)≥μ_2 (G)≥⋯≥μ_n (G)=0 are the Laplacian eigenvalues of the graph G. Some upper and lower bounds for LEL are presented in this note. Moreover, throughout this work, some results related to lower bound of spectral radius of graph are obtained using the term of ΔG as the num...
متن کامل